Efficient Public-Key Cryptography in the Presence of Key Leakage

نویسندگان

  • Yevgeniy Dodis
  • Kristiyan Haralambiev
  • Adriana López-Alt
  • Daniel Wichs
چکیده

We study the design of cryptographic primitives resistant to a large class of side-channel attacks, called“memory attacks”, where an attacker can repeatedly and adaptively learn information about the secret key,subject only to the constraint that the overall amount of such information is bounded by some parameter`. Although the study of such primitives was initiated only recently by Akavia et al. [3], subsequent workalready produced many such “leakage-resilient” primitives [53, 5, 47], including signature, encryption, iden-tification (ID) and authenticated key agreement (AKA) schemes. Unfortunately, every existing scheme, —for any of the four fundamental primitives above, — fails to satisfy at least one of the following desirableproperties:• Efficiency. While the construction may be generic, it should have some efficient instantiations, basedon standard cryptographic assumptions, and without relying on random oracles.• Strong Security. The construction should satisfy the strongest possible definition of security (even inthe presence of leakage). For example, encryption schemes should be secure against chosen ciphertextattack (CCA), while signatures should be existentially unforgeable.• Leakage Flexibility. It should be possible to set the parameters of the schemes so that the leakagebound ` can come arbitrarily close to the size of the secret key sk. In this work we design the first signature, encryption, ID and AKA schemes which overcome these lim-itations, and satisfy all the properties above. Moreover, all our constructions are generic, in several caseselegantly simplifying and generalizing the prior constructions (which did not have any efficient instantia-tions). We also introduce several tools of independent interest, such as the abstraction (and constructions)of true-simulation extractable NIZK arguments, and a new deniable DH-based AKA protocol based on anyCCA-secure encryption. ∗Computer Science Dept. NYU. Email: [email protected].†Computer Science Dept. NYU. Email: [email protected].‡Computer Science Dept. NYU. Email: [email protected].§Computer Science Dept. NYU. Email: [email protected].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient certificateless signcryption scheme in the standard model

Certificateless public key cryptography (CL-PKC) is a useful method in order to solve the problems of traditional public key infrastructure (i.e., large amount of computation, storage and communication costs for managing certificates) and ID-based public key cryptography (i.e., key escrow problem), simultaneously. A signcryption scheme is an important primitive in cryptographic protocols which ...

متن کامل

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...

متن کامل

Comparison of two Public Key Cryptosystems

Since the time public-key cryptography was introduced by Diffie andHellman in 1976, numerous public-key algorithms have been proposed. Some of thesealgorithms are insecure and the others that seem secure, many are impractical, eitherthey have too large keys or the cipher text they produce is much longer than theplaintext. This paper focuses on efficient implementation and analysis of two mostpo...

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

EEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations

GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...

متن کامل

Toward an energy efficient PKC-based key management system for wireless sensor networks

Due to wireless nature and hostile environment, providing of security is a critical and vital task in wireless sensor networks (WSNs). It is known that key management is an integral part of a secure network. Unfortunately, in most of the previous methods, security is compromised in favor of reducing energy consumption. Consequently, they lack perfect resilience and are not fit for applications ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010